Inverse semigroups determined by their partial automorphism monoids
نویسندگان
چکیده
منابع مشابه
Partial automorphism semigroups
We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism (elementary equivalence) of the subsemigroups yield...
متن کاملOn syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
We deal with the maximal bifix code construction which is a natural generalization of a group code construction. For a surjective morphism from a free monoidA∗ onto a completely simple semigroup with an adjoined identityM(G; I, J ; )1 and a submonoid S of M(G; I, J ; )1, under certain conditions, the base of a submonoid −1(S) is a maximal bifix code X. We investigate the relationships between t...
متن کاملThe semigroups of order 9 and their automorphism groups
We report the number of semigroups with 9 elements up to isomorphism or anti-isomorphism to be 52 989 400 714 478 and up to isomorphism to be 105 978 177 936 292. We obtained these results by combining computer search with recently published formulae for the number of nilpotent semigroups of degree 3. We further provide a complete account of the automorphism groups of the semigroups with at mos...
متن کاملMarkov semigroups, monoids, and groups
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown...
متن کاملEnds for Monoids and Semigroups
We give a graph-theoretic definition for the number of ends of Cayley digraphs for finitely generated semigroups and monoids. For semigroups and monoids, left Cayley digraphs can be very different from right Cayley digraphs. In either case, the number of ends for the Cayley digraph does not depend upon which finite set of generators is used for the semigroup or monoid. For natural numbers m and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2006
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700015810